Luca Trevisan Notes for Lecture 1
نویسنده
چکیده
Hundreds of interesting and important combinatorial optimization problems are NP-hard, and so it is unlikely that any of them can be solved by a wost-case efficient exact algorithm. Short of proving P = NP, when one deals with an NP-hard problem one must accept a relaxation of one or more of the requirements of having a an optimal algorithm that runs in polynomial time on all inputs. Possible ways of “coping” with NP-hardness are to design algorithms that
منابع مشابه
Introduction to Modern Cryptography
Forewords This book contains a set of lecture notes that I wrote for an offering of a " Topics in Cryptography " course at Columbia University, in the Spring 1999. It is not clear what use one can make of these notes. The main purpose was to integrate the treatment of the Goldwasser-Bellare lecture notes with some additional proofs, without getting into the level of rigor of Goldreich's book. I...
متن کاملNotes for Lecture 4
The polynomial hierarchy starts with familiar classes on level one: Σ1 = NP and Π1 = coNP. For all i ≥ 1, it includes two classes, Σi and Πi, which are defined as follows: Definition 2 Σk is the class of all problems such that there is a polynomial time computable F (·, ..., ·) and k polynomials p1(), ..., pk() such that x is a YES-instance⇔ ∃y1 ∈ {0, 1}1.∀y2 ∈ {0, 1}p2(|x|). . . . . . . ∀/∃ k ...
متن کاملNotes for Lecture 8
In these notes we introduce Levin’s theory of average-case complexity. This theory is still in its infancy: in these notes we will introduce the notion of “distributional problems,” discuss various formalizations of the notion of “algorithms that are efficient on average,” introduce a reducibility that preserves efficient average-case solvability. Next time we will prove that there is a problem...
متن کاملLecture Notes on Expansion, Sparsest Cut, and Spectral Graph Theory
Foreword These notes are a lightly edited revision of notes written for the course " Graph Partitioning and Expanders " offered at Stanford in Winter 2011 and Winter 2013. I wish to thank the students who attended this course for their enthusiasm and hard work. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author and do not necessarily re...
متن کاملNotes for Lecture 3 Some Consequences of the Pcp Theorem
Let now φ be an instance of 3SAT with n variables x1, . . . , xn and m clauses. For each variable xi, let occi be the number of occurrences of xi, that is, the number of clauses that involve the literal xi or the literal x̄i. We write xi ∈ Cj if the variable xi occurs in clause Cj . Notice that ∑n i=1 occi = 3m. For each i, construct a 1-expander graph Gi = (Vi, Ei) where Vi has occi vertices, o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006